MR Image Reconstruction Using Block Matching and Adaptive Kernel Methods
نویسندگان
چکیده
An approach to Magnetic Resonance (MR) image reconstruction from undersampled data is proposed. Undersampling artifacts are removed using an iterative thresholding algorithm applied to nonlinearly transformed image block arrays. Each block array is transformed using kernel principal component analysis where the contribution of each image block to the transform depends in a nonlinear fashion on the distance to other image blocks. Elimination of undersampling artifacts is achieved by conventional principal component analysis in the nonlinear transform domain, projection onto the main components and back-mapping into the image domain. Iterative image reconstruction is performed by interleaving the proposed undersampling artifact removal step and gradient updates enforcing consistency with acquired k-space data. The algorithm is evaluated using retrospectively undersampled MR cardiac cine data and compared to k-t SPARSE-SENSE, block matching with spatial Fourier filtering and k-t ℓ1-SPIRiT reconstruction. Evaluation of image quality and root-mean-squared-error (RMSE) reveal improved image reconstruction for up to 8-fold undersampled data with the proposed approach relative to k-t SPARSE-SENSE, block matching with spatial Fourier filtering and k-t ℓ1-SPIRiT. In conclusion, block matching and kernel methods can be used for effective removal of undersampling artifacts in MR image reconstruction and outperform methods using standard compressed sensing and ℓ1-regularized parallel imaging methods.
منابع مشابه
Block-Based Compressive Sensing Using Soft Thresholding of Adaptive Transform Coefficients
Compressive sampling (CS) is a new technique for simultaneous sampling and compression of signals in which the sampling rate can be very small under certain conditions. Due to the limited number of samples, image reconstruction based on CS samples is a challenging task. Most of the existing CS image reconstruction methods have a high computational complexity as they are applied on the entire im...
متن کاملStructure matching driven by joint-saliency-structure adaptive kernel regression
For nonrigid image registration, matching the particular structures (or the outliers) that have missing correspondence and/or local large deformations, can be more difficult than matching the common structures with small deformations in the two images. Most existing works depend heavily on the outlier segmentation to remove the outlier effect in the registration. Moreover, these works do not ha...
متن کاملImage Reconstruction using a 2D M-channel Perfect Reconstruction Filter Bank with an Optimized Adaptive Interpolation Kernel
In this paper, we propose an image reconstruction method utilizing an optimized adaptive interpolation kernel along with a 2D M-channel perfect reconstruction filter bank(M-ch PR-FB) structure. In particular, the proposed approach leads to sharper reconstructed images than a direct conversion, still preserving high frequency components of the original image by employing the subband processing o...
متن کاملMulti-frame Super Resolution for Improving Vehicle Licence Plate Recognition
License plate recognition (LPR) by digital image processing, which is widely used in traffic monitor and control, is one of the most important goals in Intelligent Transportation System (ITS). In real ITS, the resolution of input images are not very high since technology challenges and cost of high resolution cameras. However, when the license plate image is taken at low resolution, the license...
متن کاملA Block-Grouping Method for Image Denoising by Block Matching and 3-D Transform Filtering
Image denoising by block matching and threedimensionaltransform filtering (BM3D) is a two steps state-ofthe-art algorithm that uses the redundancy of similar blocks innoisy image for removing noise. Similar blocks which can havesome overlap are found by a block matching method and groupedto make 3-D blocks for 3-D transform filtering. In this paper wepropose a new block grouping algorithm in th...
متن کامل